Contravariant Finiteness and Iterated Strong Tilting
نویسندگان
چکیده
Abstract Let $\mathcal {P}^{<\infty } ({\Lambda }\text {-mod})$ P < ∞ ( Λ -mod ) be the category of finitely generated left modules finite projective dimension over a basic Artin algebra Λ. We develop widely applicable criterion that reduces test for contravariant finiteness in Λ-mod to corner algebras e Λ suitable idempotents ∈Λ. The reduction substantially facilitates access numerous homological benefits entailed by . consequences pursued here hinge on fact this condition is known equivalent existence strong tilting object Λ-mod. moreover characterize situation which process strongly allows unlimited iteration: This occurs precisely when, $\text {mod-}\widetilde {\Lambda }$ mod- ~ right tilted $\widetilde , subcategory turn contravariantly finite; latter can, once again, tested corners original In (frequently occurring) positive case, sequence consecutive tilts, {\widetilde }}$ }}}, \dots $ , … shown periodic with period 2 (up Morita equivalence); moreover, any two adjacent categories (\text })$ }(\widetilde }}\text }(\text }}}), alternating between and modules, are dual via Hom-functors induced bimodules both sides. Our methods rely comparisons -approximations Λ-mod, -mod Giraud determined ; these interactions hold interest their own right. particular, they underlie our analysis indecomposable direct summands modules.
منابع مشابه
Strong Normalizability as a Finiteness Structure
In the folklore of linear logic, a common intuition is that the structure of finiteness spaces, introduced by Ehrhard, semantically reflects the strong normalization property of cut-elimination. We make this intuition formal in the context of the non-deterministic λ-calculus by introducing a finiteness structure on resource terms, which is such that a λ-term is strongly normalizing iff the supp...
متن کاملStrong Equivalence Relations for Iterated Models
The Iterated Immediate Snapshot model (IIS), due to its elegant topological representation, has become standard for applying topological reasoning to distributed computing. In this paper, we focus on relations between IIS and the more realistic (non-iterated) read-write AtomicSnapshot memory model (AS). We grasp equivalences between subsets of runs of AS and IIS (we call them sub-IIS and sub-AS...
متن کاملStrong Syntax Splitting for Iterated Belief Revision
AGM theory is the most influential formal account of belief revision. Nevertheless, there are some issues with the original proposal. In particular, Parikh has pointed out that completely irrelevant information may be affected in AGM revision. To remedy this, he proposed an additional axiom (P) aiming to capture (ir)relevance by a notion of syntax splitting. In this paper we generalize syntax s...
متن کاملContravariant Geometry Description
We introduce a new type of geometry description, dual to the standard way of geometry description. It allows to describe and modify very complex geometries in a simple way.
متن کاملLogics for Contravariant Simulations
Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that “the larger the number of behaviors, the better”. Therefore, they can be considered to be more adequate to express the fact that a system is a correct implementation of some specification. We have previously ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebras and Representation Theory
سال: 2022
ISSN: ['1386-923X', '1572-9079']
DOI: https://doi.org/10.1007/s10468-022-10180-z